1-Generic degrees and minimal degrees in higher recursion theory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1-Generic Degrees Bounding Minimal Degrees Revisited

We show that over the base system P− + Σ2-bounding, the existence of a 1-generic degree < 0′′ bounding a minimal degree is equivalent to Σ2-induction.

متن کامل

Degrees in $k$-minimal label random recursive trees

This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring

متن کامل

Degrees which do not bound minimal degrees

The high/low hierarchy respects the ordering of degrees, and so we can expect to find properties of order which are possessed by all degrees in a given hierarchy class. Such properties can also be found for classes of the generalized high/low hierarchy even though that hierarchy does not respect the ordering of the degrees. For example, Jockusch and Posner [4], extending a result of Cooper [l],...

متن کامل

On minimal wtt-degrees and computably enumerable Turing degrees

Computability theorists have studied many different reducibilities between sets of natural numbers including one reducibility (≤1), many-one reducibility (≤m), truth table reducibility (≤tt), weak truth table reducibility (≤wtt) and Turing reducibility (≤T ). The motivation for studying reducibilities stronger that Turing reducibility stems from internally motivated questions about varying the ...

متن کامل

Constructing Minimal Pairs of Degrees

We prove that there exist sets of natural numbers A and B such that A and B form a minimal pair with respect to Turing reducibility, enumeration reducibility, hyperarithmetical reducibility and hyperenumer-ation reducibility. Relativized versions of this result are presented as well. 1. Introduction In the present paper we consider four kinds of reducibilities among sets of natural numbers: Tur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Japanese journal of mathematics. New series

سال: 1987

ISSN: 0289-2316,1861-3624

DOI: 10.4099/math1924.13.381